Kemeny’s constant and the effective graph resistance
نویسندگان
چکیده
Article history: Received 18 July 2017 Accepted 5 September 2017 Available online 7 September 2017 Submitted by R. Brualdi MSC: 15A09 15A18 15A63
منابع مشابه
Kemeny's Constant And An Analogue Of Braess' Paradox For Trees
Given an irreducible stochastic matrix M, Kemeny’s constant K(M) measures the expected time for the corresponding Markov chain to transition from any given initial state to a randomly chosen final state. A combinatorially based expression for K(M) is provided in terms of the weights of certain directed forests in a directed graph associated with M , yielding a particularly simple expression in ...
متن کاملOn the spectrum of the normalized Laplacian of iterated triangulations of graphs
The eigenvalues of the normalized Laplacian of a graph provide information on its topological and structural characteristics and also on some relevant dynamical aspects, specifically in relation to random walks. In this paper we determine the spectra of the normalized Laplacian of iterated triangulations of a generic simple connected graph. As an application, we also find closed-forms for their...
متن کاملKemeny's Constant and the Random Surfer
We revisit Kemeny’s constant in the context of Web navigation, also known as “surfing”. We derive bounds on the constant and give it a novel interpretation in terms of the number of links a random surfer will follow to reach his final destination.
متن کاملGraph Clustering using Effective Resistance
We design a polynomial time algorithm that for any weighted undirected graph G = (V,E,w) and sufficiently large δ > 1, partitions V into subsets V1, . . . , Vh for some h ≥ 1, such that • at most δ fraction of the weights are between clusters, i.e. w(E − ∪hi=1E(Vi)) . w(E) δ ; • the effective resistance diameter of each of the induced subgraphs G[Vi] is at most δ 3 times the average weighted de...
متن کاملA k-Majority Digraphs and the Hardness of Voting with a Constant Number of Voters
Many hardness results in computational social choice make use of the fact that every directed graph may be induced as the pairwise majority relation of some preference profile. However, this fact requires a number of voters that is almost linear in the number of alternatives. It is therefore unclear whether these results remain intact when the number of voters is bounded, as is, for example, ty...
متن کامل